package binary_search;

public class searchInsert {
    public int searchInsert(int[] nums, int target) {
        int left = 0;
        int right = nums.length -1;
        int mid = 0;
        while(left<right) {
            mid = left+(right-left)/2;
            if(nums[mid] < target) {
                left = mid+1;
            }else if(nums[mid] >= target) {
                right = mid;
            }
        }
        if(nums[right] < target) {
            return right+1;
        }
        return right;

    }
}
